منابع مشابه
Hyper-Systolic Matrix Multiplication
A novel parallel algorithm for matrix multiplication is presented. The hyper-systolic algorithm makes use of a one-dimensional processor abstraction. The procedure can be implemented on all types of parallel systems. It can handle matrix-vector multiplications as well as transposed matrix products.
متن کامل2D matrix multiplication on a 3D systolic array
The introduction of systolic arrays in the late 1970s had an enormous impact on the area of special purpose computing. However, most of the work so far has been done with onedimensional and two-dimensional (2D) systolic arrays. Recent advances in three-<limensional VLSI (3D VLSI) and 3D packaging of2D VLSI components, has made the idea of 3D systolic arrays feasible in the near future. In this ...
متن کاملHyper-Systolic Parallel Computing
A new class of parallel algorithms is introduced that can achieve a complexity of O(n 3 2 ) with respect to the interprocessor communication, in the exact computation of systems with pairwise mutual interactions of all elements. Hitherto, conventional methods exhibit a communicational complexity of O(n). The amount of computation operations is not altered for the new algorithm which can be form...
متن کاملGeneralized Hyper-Systolic Algorithm
We generalize the hyper-systolic algorithm proposed in [1] for abstract data structures on massive parallel computers with np processors. For a problem of size V the communication complexity of the hyper-systolic algorithm is proportional to √ npV , to be compared with npV for the systolic case. The implementation technique is explained in detail and the example of the parallel matrix-matrix mu...
متن کاملMatrix-Matrix Multiplication Using Systolic Array Architecture in Bluespec Team SegFault
Computing matrix products is both a central operation in many numerical algorithms and potentially time consuming, making it one of the most well-studied problems in numerical computing. Various algorithms have been devised for computing C = AB, especially for large matrices. Mapping such algorithms to custom or general purpose hardware architecture is always a challenging task. By having a cus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2001
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(00)00108-3